Filtered-top-k association discovery
نویسنده
چکیده
Association mining has been one of the most intensively researched areas of data mining. However, direct uptake of the resulting technologies has been relatively low. This paper examines some of the reasons why the dominant paradigms in association mining have not lived up to their promise, and argues that a powerful alternative is provided by top-k techniques coupled with appropriate statistical and other filtering.
منابع مشابه
A Quick Method for Querying Top-k Rules from Class Association Rule Set
Finding class association rules (CARs) is one of the most important research topics in data mining and knowledge discovery, with numerous applications in many fields. However, existing techniques usually generate an extremely large number of results, which makes analysis difficult. In many applications, experts are interested in only the most relevant results. Therefore, we propose a method for...
متن کاملSecure Top-k Subgroup Discovery
Supervised descriptive rule discovery techniques like subgroup discovery are quite popular in applications like fraud detection or clinical studies. Compared with other descriptive techniques, like classical support/confidence association rules, subgroup discovery has the advantage that it comes up with only the top-k patterns, and that it makes use of a quality function that avoids patterns un...
متن کاملMining Level-Crossing Association Rules from Large Databases
Existing algorithms for mining association rule at multiple concept level, restricted mining strong association among the concept at same level of a hierarchy. However mining level-crossing association rule at multiple concept level may lead to the discovery of mining strong association among at different level of hierarchy. In this study, a top-down progressive deepening method is developed fo...
متن کاملSecure Distributed Subgroup Discovery in Horizontally Partitioned Data
Supervised descriptive rule discovery techniques like subgroup discovery are quite popular in applications like fraud detection or clinical studies. Compared with other descriptive techniques, like classical support/confidence association rules, subgroup discovery has the advantage that it comes up with only the top-k patterns, and that it makes use of a quality function that avoids patterns un...
متن کاملDiscovery of Top-k Dense Subgraphs in Dynamic Graph Collections
Dense subgraph discovery is a key issue in graph mining, due to its importance in several applications, such as correlation analysis, community discovery in the Web, gene co-expression and protein-protein interactions in bioinformatics. In this work, we study the discovery of the top-k dense subgraphs in a set of graphs. After the investigation of the problem in its static case, we extend the m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Wiley Interdisc. Rew.: Data Mining and Knowledge Discovery
دوره 1 شماره
صفحات -
تاریخ انتشار 2011